Normalization Results for Typeable Rewrite Systems
نویسندگان
چکیده
منابع مشابه
Normalization Results for Typeable Rewrite Systems
In this paper we introduce Curryfied Term Rewriting Systems, and a notion of partial type assignment on terms and rewrite rules that uses intersection types with sorts and . Three operations on types – substitution, expansion, and lifting – are used to define type assignment, and are proved to be sound. With this result the system is proved closed for reduction. Using a more liberal approach to...
متن کاملStrong Normalization of Typeable Rewrite Systems
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewrite Systems, that consists of assigning intersection types to function symbols, and specifying the way in which types can be assigned to nodes and edges between nodes in the tree representation of terms. Two operations o...
متن کامل(Head-) Normalization of Typeable Rewrite Systems
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable systems. On one hand, for all systems that satisfy a variant of the Jouannaud-Okada Recursion Scheme, every term typeable with a type that is not is head normalizable. On the other hand, non-Curryfied terms that are ...
متن کاملApproximation and Normalization Results for Typeable Combinator Systems
This paper studies the relation between types and normalization in the context of Combinator Systems. It presents notions of approximants for terms, intersection type assignment, and reduction on derivations; the last will be proved to be strongly normalizable. With this result, it is proved that, for every typeable term, there exists an approximant of that term with the same type, and a charac...
متن کاملApproximation and Normalization Results for Typeable Term Rewriting Systems
We consider an intersection type assignment system for term rewriting systems extended with application, and define a notion of (finite) approximation on terms. We then prove that for typeable rewrite systems satisfying a general scheme for recursive definitions, every typeable term has an approximant of the same type. This approximation result, and the proof technique developed to obtain it, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1997
ISSN: 0890-5401
DOI: 10.1006/inco.1996.2617